Distributed gradient for multi-robot motion planning
نویسنده
چکیده
Distributed stochastic search is proposed for cooperative behavior in multi-robot systems. Distributed gradient is examined. This method consists of multiple stochastic search algorithms that start from different points in the solutions space and interact to each other while moving towards the goal position. Distributed gradient is shown to be efficient when the motion of the robots towards the goal position is described by a quadratic cost function. The algorithm’s performance is evaluated through simulation tests.
منابع مشابه
Distributed motion planning and sensor fusion for cooperative behavior of mobile robots
The paper analyzes two important issues in the design of multi-robot systems: (i) motion planning with the use of distributed algorithms, (ii) sensor fusion with the use of Extended Kalman or Particle Filtering. First, distributed gradient for motion planning of a multi-robot system is examined. The dynamic model of the multi-robot system is derived and its convergence to the desirable position...
متن کاملDecentralized Path Planning for Coverage Tasks Using Gradient Descent Adaptive Control Decentralized Path Planning for Coverage Tasks Using Gradient Descent Adaptive Control
In this paper we propose a new path planning algorithm for coverage tasks in unknown environments that does not rely on recursive search optimization. Given a sensory function that captures the interesting locations in the environment and can be learned, the goal is to compute a set of closed paths that allows a single robot or a multi-robot system to sense/cover the environment according to th...
متن کاملPlanning Robot Motion in a 2-D Region with Unknown Obstacles
The purpose of this paper is to present several algorithms for planning the motion of a robot in a two-dimensional region having obstacles whose shapes and locations are unknown. The convergence and efficiency of the algorithms are discussed and upper bounds for the lengths of paths generated by the different algorithms are derived and compared.
متن کاملMotion planning and Collision Avoidance using Non-Gradient Vector Fields - Technical Report
This paper presents a novel feedback method on the motion planning for unicycle robots in environments with static obstacles, along with an extension to the distributed planning and coordination in multi-robot systems. The method employs a family of 2-dimensional analytic vector fields, whose integral curves exhibit various patterns depending on the value of a parameter λ. More specifically, fo...
متن کاملDecentralized path planning for coverage tasks using gradient descent adaptive control
In this paper we propose a new path planning algorithm for coverage tasks in unknown environments that does not rely on recursive search optimization. Given a sensory function that captures the interesting locations in the environment and can be learned, the goal is to compute a set of closed paths that allows a single robot or a multirobot system to sense/cover the environment according to thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005